Towards an optimal condition number of certain augmented Lagrangian-type saddle-point matrices
نویسندگان
چکیده
We present an analysis for minimizing the condition number of nonsingular parameter-dependent 2 2 block-structured saddle-point matrices with a maximally rank-deficient (1,1) block. The matrices arise from an augmented Lagrangian approach. Using quasidirect sums, we show that a decomposition akin to simultaneous diagonalization leads to an optimization based on the extremal nonzero eigenvalues and singular values of the associated block matrices. Bounds on the condition number of the parameter-dependent matrix are obtained, and we demonstrate their tightness on some numerical examples. Copyright © 2016 John Wiley & Sons, Ltd.
منابع مشابه
On the eigenvalues of a class of saddle point matrices
We study spectral properties of a class of block 2× 2 matrices that arise in the solution of saddle point problems. These matrices are obtained by a sign change in the second block equation of the symmetric saddle point linear system. We give conditions for having a (positive) real spectrum and for ensuring diagonalizability of the matrix. In particular, we show that these properties hold for t...
متن کاملOn the augmented Lagrangian approach to Signorini elastic contact problem
The Signorini problem describes the contact of a linearly elastic body with a rigid frictionless foundation. It is transformed into a saddle point problem of some augmented Lagrangian functional and then discretized by nite element methods. Optimal error estimates are obtained for general smooth domains which are not necessarily convex. The key ingredient in the analysis is a discrete inf-sup c...
متن کاملAugmented Lagrangian Techniques for Solving Saddle Point Linear Systems
We perform an algebraic analysis of a generalization of the augmented Lagrangian method for solution of saddle point linear systems. It is shown that in cases where the (1,1) block is singular, specifically semidefinite, a low-rank perturbation that minimizes the condition number of the perturbed matrix while maintaining sparsity is an effective approach. The vectors used for generating the per...
متن کاملTwo preconditioners for saddle point problems in fluid flows
In this paper two preconditioners for the saddle point problem are analysed: one based on the augmented Lagrangian approach and another involving artificial compressibility. Eigenvalue analysis shows that with these preconditioners small condition numbers can be achieved for the preconditioned saddle point matrix. The preconditioners are compared with commonly used preconditioners from literatu...
متن کاملOn the Convergence of Min/sup Points in Optimal Control Problems
In case f0 and C are convex, a variety of primal/dual numerical methods can be used to find the saddle points of a Lagrangian L associated with this problem [4, 7]. These methods take advantage of the fact that the search for the saddle points of L is unconstrained, or conducted over sets much simpler than C. Furthermore, we can introduce penalties on f0 in a way that regularizes L and makes it...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Numerical Lin. Alg. with Applic.
دوره 23 شماره
صفحات -
تاریخ انتشار 2016